Groebner Bases
نویسنده
چکیده
The study of ideals in polynomial rings over fields is absolutely central to algebraic geometry. We think of an affine variety (usually called affine algebraic set without an irreducibility hypothesis) in n dimensions as defined to be the common zero set of a collection of polynomials f1(x1, . . . , xn), . . . , fm(x1, . . . , xn) with coefficients in some field k. We see that if a point (c1, . . . , cn) is a zero of each of the fi, then it is a zero of any polynomials in the ideal I ⊆ k[x1, . . . , xn] generated by the xi. We further see that if f ∈ k[x1, . . . , xn] has f ∈ I for some d ≥ 1, then f(c1, . . . , cn) = 0, so f(c1, . . . , cn) = 0. This motivates the following definitions: Definition 1.1. Given an ideal I ⊆ k[x1, . . . , xn], we define V (I) ⊆ k to be the set of points (c1, . . . , cn) with f(c1, . . . , cn) = 0 for all f ∈ I. Given a subset S ⊆ k, we define I(S) ⊆ k[x1, . . . , xn] to be the set of functions f such that f(c1, . . . , cn) = 0 for all (c1, . . . , cn) ∈ S. Finally, if I ⊆ R is an ideal in a commutative ring, we set rad(I) := {f ∈ R : ∃d ≥ 1, f ∈ I}, and say I is radical if rad(I) = I.
منابع مشابه
Groebner Bases Computation in Boolean Rings is P-SPACE
The theory of Groebner Bases, which has recently been honored with the ACM Paris Kanellakis Theory and Practice Award, has become a crucial building block to computer algebra, and is widely used in science, engineering, and computer science. It is wellknown that Groebner bases computation is EXP-SPACE in a general polynomial ring setting. However, for many important applications in computer sci...
متن کاملA P-SPACE Algorithm for Groebner Bases Computation in Boolean Rings
The theory of Groebner Bases, which has recently been honored with the ACM Paris Kanellakis Theory and Practice Award, has become a crucial building block to computer algebra, and is widely used in science, engineering, and computer science. It is wellknown that Groebner bases computation is EXP-SPACE in a general setting. In this paper, we give an algorithm to show that Groebner bases computat...
متن کاملGroebner Bases in Non-Commutative Algebras
INTRODUCTION Recently, the use of Groebner bases and Buchberger algorithm [BUC1,2,4] has been generalised from the case of commutative polynomials to finitely generated algebras R over a field k, R = k, s.t. for each i < j, for some cij ∈ k, for some commutative polynomial pij ∈ k[X1,...,Xn], one has xj xi cij xi xj = pij(x1,...,xn). The first results in this direction were due to Ga...
متن کاملConstruction of Gröbner Bases: Avoiding S-Polynomials – Buchberger’s First Criterium
We continue the formalization of Groebner bases following the book “Groebner Bases – A Computational Approach to Commutative Algebra” by Becker and Weispfenning. Here we prove Buchberger’s first criterium on avoiding S-polynomials: S-polynomials for polynomials with disjoint head terms need not be considered when constructing Groebner bases. In the course of formalizing this theorem we also int...
متن کاملGroebner basis techniques in multidimensional multirate systems
The Euclidean algorithm is a frequently used tool in the analysis of one-dimensional (1D) multirate systems. This tool is however not available for multidimensional (MD) multirate systems. In this paper we discus how Groebner basis techniques can ll this gap. After presenting the relevant facts about Groebner bases, we will show in a few examples how this technique can contribute to MD multirat...
متن کاملGroebner Bases and the Cohomology of Grassmann Manifolds with Application to Immersion
LetGk,n be the Grassmannmanifold of k-planes inR . Borel showed that H∗ (Gk,n; Z2) = Z2 [w1, . . . , wk] /Ik,n where Ik,n is the ideal generated by the dual Stiefel-Whitney classes wn+1, . . . , wn+k. We compute Groebner bases for the ideals I2,2i−3 and I2,2i−4 and use these results along with the theory of modi ed Postnikov towers to prove new immersion results, namely that G2,2i−3 immerses in...
متن کامل